@inproceedings{rootpaper,
  author    = {Mark Hopkins and
               Adnan Darwiche},
  title     = {A Practical Relaxation of Constant-Factor Treewidth Approximation
               Algorithms},
  booktitle = {Probabilistic Graphical Models},
  year      = {2002},
  ee        = {http://www.info-ab.uclm.es/isl/cuenca/proceedings/proc-elec/papers/pgm02-9.ps.gz},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@techreport{hop,
  author    = {Mark Hopkins and
               Adnan Darwiche},
  title     = {Graph triangulation from the perspective of decomposition trees},
  year      = {2002},
  institution = {Computer science departmnent, UCLA, Los Angeles}
}

@article{robert,
  author    = {Neil Robertson and
               Paul D. Seymour},
  title     = {Graph Minors .XIII. The Disjoint Paths Problem},
  journal   = {J. Comb. Theory, Ser. B},
  volume    = 63,
  number    = 1,
  year      = 1995,
  pages     = {65-110},
  ee        = {http://dx.doi.org/10.1006/jctb.1995.1006},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@book{ocaml,
  author    = {Pierre Weis and
               Xavier Leroy},
  title     = {Le langage Caml},
  publisher = {InterEditions},
  year      = 1993,
  isbn      = {978-2-7296-0493-6},
  pages     = {I-XIII, 1-407},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{tree,
  author = {Thomas van Dijk,
            Jan-Pieter van den Heuvel,
            Wouter Slob},
  title = {Computing treewidth with LibTW},
year = 2006,

}

@inproceedings{ref,
  author    = {Emgad H. Bachoore and
               Hans L. Bodlaender},
  title     = {A Branch and Bound Algorithm for Exact, Upper, and Lower
               Bounds on Treewidth},
  booktitle = {AAIM},
  year      = {2006},
  pages     = {255-266},
  ee        = {http://dx.doi.org/10.1007/11775096_24},
  crossref  = {DBLP:conf/aaim/2006},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/aaim/2006,
  editor    = {Siu-Wing Cheng and
               Chung Keung Poon},
  title     = {Algorithmic Aspects in Information and Management, Second
               International Conference, AAIM 2006, Hong Kong, China, June
               20-22, 2006, Proceedings},
  booktitle = {AAIM},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {4041},
  year      = {2006},
  isbn      = {3-540-35157-4},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{btwibn,
 author = {Kwisthout, Johan H. P. and Bodlaender, Hans L. and van der Gaag, L. C.},
 title = {The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks},
 booktitle = {Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence},
 year = {2010},
 isbn = {978-1-60750-605-8},
 pages = {237--242},
 numpages = {6},
 url = {http://dl.acm.org/citation.cfm?id=1860967.1861015},
 acmid = {1861015},
 publisher = {IOS Press},
 address = {Amsterdam, The Netherlands, The Netherlands},
} 